A Kolmogorov Complexity { based Geneti Programming Toolfor String
نویسنده
چکیده
منابع مشابه
Kolmogorov Complexity of Categories
Kolmogorov complexity theory is used to tell what the algorithmic informational content of a string is. It is defined as the length of the shortest program that describes the string. We present a programming language that can be used to describe categories, functors, and natural transformations. With this in hand, we define the informational content of these categorical structures as the shorte...
متن کاملGenetic Programming Estimates of Kolmogorov Complexity
In this paper the problem of the Kolmogorov complexity related to binary strings is faced. We propose a Genetic Programming approach which consists in evolving a population of Lisp programs looking for the optimal program that generates a given string. This evolutionary approach has permited to overcome the intractable space and time diiculties occurring in methods which perform an approximatio...
متن کاملKolmogorov Complexity, String Information, Panspermia and the Fermi Paradox
Bit strings rather than byte files can be a mode of transmission both for intelligent signals and for travels of extraterrestrial life. Kolmogorov complexity, i.e. the minimal length of a binary coded string completely defining a system, can then, due to its universality, become a key concept in the strategy of the search of extraterrestrials. Evaluating, for illustration, the Kolmogorov comple...
متن کاملA Short Introduction to Kolmogorov Complexity
This is a short introduction to Kolmogorov complexity and information theory. The interested reader is referred to the literature, especially the textbooks [CT91] and [LV97] which cover the fields of information theory and Kolmogorov complexity in depth and with all the necessary rigor. They are well to read and require only a minimum of prior knowledge. Kolmogorov complexity. Also known as alg...
متن کاملQuantum Kolmogorov Complexity
In this paper we give a definition for quantum Kolmogorov complexity. In the classical setting, the Kolmogorov complexity of a string is the length of the shortest program that can produce this string as its output. It is a measure of the amount of innate randomness (or information) contained in the string. We define the quantum Kolmogorov complexity of a qubit string as the length of the short...
متن کامل